Graphical designs and gale duality
نویسندگان
چکیده
A graphical design is a subset of graph vertices such that the weighted averages certain eigenvectors over agree with their global averages. We use Gale duality to show positively designs in regular graphs are bijection faces generalized eigenpolytope graph. This connection can be used organize, compute and optimize designs. illustrate power this tool on three families Cayley – cocktail party graphs, cycles, hypercubes by computing or bounding smallest average all but last eigenspace frequency order.
منابع مشابه
Gale Duality and Koszul Duality
Given a hyperplane arrangement in an affine space equipped with a linear functional, we define two finite-dimensional, noncommutative algebras, both of which are motivated by the geometry of hypertoric varieties. We show that these algebras are Koszul dual to each other, and that the roles of the two algebras are reversed by Gale duality. We also study the centers and representation categories ...
متن کاملGale Duality for Complete Intersections
We show that every complete intersection defined by Laurent polynomials in an algebraic torus is isomorphic to a complete intersection defined by master functions in the complement of a hyperplane arrangement, and vice versa. We call systems defining such isomorphic schemes Gale dual systems because the exponents of the monomials in the polynomials annihilate the weights of the master functions...
متن کاملGale duality and free resolutions of ideals of points
What is the shape of the free resolution of the ideal of a general set of points in P? This question is central to the programme of connecting the geometry of point sets in projective space with the structure of the free resolutions of their ideals. There is a lower bound for the resolution computable from the (known) Hilbert function, and it seemed natural to conjecture that this lower bound w...
متن کاملAlexander duality in experimental designs
If F is a full factorial design and D is a fraction of F , then for a givenmonomial ordering, the algebraic method gives a saturated polynomial basis for D which can be used for regression. Consider now an algebraic basis for the complementary fraction of D in F , built under the same monomial ordering. We show that the basis for the complementary fraction is the Alexander dual of the first bas...
متن کاملDuality and the Continuous Graphical Model
Inspired by the Linear Programming based algorithms for discrete MRFs, we show how a corresponding infinite-dimensional dual for continuous-state MRFs can be approximated by a hierarchy of tractable relaxations. This hierarchy of dual programs includes as a special case the methods of Peng et al. [17] and Zach & Kohli [33]. We give approximation bounds for the tightness of our construction, stu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2022
ISSN: ['0025-5610', '1436-4646']
DOI: https://doi.org/10.1007/s10107-022-01861-0